Distance browsing in spatial databases

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Critique & Summary of Scalable Network Distance Browsing in Spatial Databases

Introduction In today's world, the mapping services like Google Maps, Microsoft MapPoint etc have gained significant popularity for finding the shortest route while travelling from place to place. These services are available online and hence the responses of it must be real time i.e. very quick. Study has revealed that people do not change the parent query however may change the sub queries wi...

متن کامل

Distance browsing in distributed multimedia databases

The state of the art of searching for non-text data (e.g., images) is to use extracted metadata annotations or text, which might be available as a related information. However, supporting real content-based audio-visual search, based on similarity search on features, is significantly more expensive than searching for text. Moreover, such search exhibits linear scalability with respect to the da...

متن کامل

Distance Join Queries of Multiple Inputs in Spatial Databases

Let a tuple of n objects obeying a query graph (QG) be called the n-tuple. The “Ddistance-value” of this n-tuple is the value of a linear function of distances of the n objects that make up this n-tuple, according to the edges of the QG. This paper addresses the problem of finding the K n-tuples between n spatial datasets that have the smallest Ddistancevalues, the so-called K-Multi-Way Distanc...

متن کامل

Multi-Way Distance Join Queries in Spatial Databases

Let a tuple of n objects obeying a query graph (QG) be called the n-tuple. The “Ddistancevalue” of this n-tuple is the value of a linear function of distances of the n objects that make up this ntuple, according to the edges of the QG. This paper addresses the problem of finding the K n-tuples between n spatial datasets that have the smallest Ddistance-values, the so-called K-Multi-Way Distance...

متن کامل

Computing Spatial Distance Histograms Efficiently in Scientific Databases

Particle simulation has become an important research tool in many scientific and engineering fields. Data generated by such simulations impose great challenges to database storage and query processing. One of the queries against particle simulation data, the spatial distance histogram (SDH) query, is the building block of many high-level analytics, and requires quadratic time to compute using a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: ACM Transactions on Database Systems

سال: 1999

ISSN: 0362-5915,1557-4644

DOI: 10.1145/320248.320255